Occlusion points propagation geodesic distance transformation
نویسندگان
چکیده
We propose a new approach to compute geodesic distance transformations in arbitrary 2D and 3D domains. The distance transformation proposed here is robust and has proved to have a computational complexity linear in the domain size. Our scheme is based on a new technique which we call occlusion points propagation, and with a higher accuracy than other geodesic distance transformations proposed before. We validate the algorithm with a set of synthetic domains, and we also make comparisons with two similar algorithms called Bd-geodesic distance transformation and Bd-geodesic distance transformation with circular propagation.
منابع مشابه
K-Voronoi diagrams computing in arbitrary domains
We propose a novel algorithm to compute Voronoi diagrams of order k in arbitrary 2D and 3D domains. The algorithm is based on a fast ordered propagation distance transformation called occlusion points propagation geodesic distance transformation (OPPGDT) which is robust and linear in the domain size, and has higher accuracy than other geodesic distance transformations published before. Our appr...
متن کاملPose - Invariant Multimodal ( 2 D + 3 D ) Face Recognition using Geodesic Distance Map
In this paper, an efficient pose-invariant face recognition method is proposed. This method is multimodal means that it uses 2D (color) and 3D (depth) information of a face for recognition. In the first step, the geodesic distances of all face points from a reference point are computed. Then, the face points are mapped from the 3D space to a new 2D space. The proposed mapping is robust under th...
متن کاملHeuristically Driven Front Propagation for Fast Geodesic Extraction
This paper presents a new method to quickly extract geodesic paths on images and 3D meshes. We use a heuristic to drive the front propagation procedure of the classical Fast Marching. This results in a modification of the Fast Marching algorithm that is similar to the A∗ algorithm used in artificial intelligence. In order to find very quickly geodesic paths between any given pair of points, two...
متن کاملOn the use of the geodesic metric in image analysis
Let X be a phase in a specimen. Given two arbitrary points x and y of X, let us define the number dx(x, y) as follows: dx(x, y) is the greatest lower bound of the lengths of the arcs in X ending at points x and y, if such arcs exist, and + CIJ if not. The function dX is a distance function, called 'geodesic distance'. Note that if x and y belong to two disjoint connected components of X, dx(x, ...
متن کاملOn the Distribution of Angles between Geodesic Rays Associated with Hyperbolic Lattice Points
For every two points z0, z1 in the upper-half plane H, consider all elements γ in the principal congruence group Γ(N), acting on H by fractional linear transformations, such that the hyperbolic distance between z1 and γz0 is at most R > 0. We study the distribution of angles between the geodesic rays [z1, γz0] as R → ∞, proving that the limiting distribution exists independently of N and explic...
متن کامل